Homogeneous Cyclotomic Polynomials and Rationality of Curves
نویسنده
چکیده
Let k be a field of arbitrary characteristic. Suppose that f1, . . . , fn are polynomials in k[t] and di = deg(fi). We prove that, if gcd of d1, . . . , dn is 1, then k(f1, . . . , fn) = f(t), or equivalently, the morphism ψ = (f1, . . . , fn) : Ak → A n k is proper and birational onto its image. By combining this result with the epimorphism theorem of Abhyankar and Moh, we prove that, if f and g are nonlinear polynomials in k[t] with relatively prime degrees, then the curve C ⊂ A given parametrically by x = f(t), y = g(t) is a rational curve not isomorphic to the affine line. To prove these results, we introduce homogeneous cyclotomic polynomials in the bivariate polynomial ring k[s, t] and explore their properties.
منابع مشابه
Construction of Pairing-Friendly Elliptic Curves
The aim of this paper is to construct pairing friendly elliptic curves. In this paper, we explain a method of finding the polynomials representing √−D and ζk over the field containing √−D and ζk and how to construct a pairing friendly elliptic curves over the cyclotomic fields containing Q(ζk, √−D) for arbitrary k and D by CP method. By using the factorization of the cyclotomic polynomial combi...
متن کاملConstructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
We describe a new method for constructing Brezing-Wenglike pairing-friendly elliptic curves. The new construction uses the minimal polynomials of elements in a cyclotomic field. Using this new construction we present new “record breaking” families of pairing-friendly curves with embedding degrees of k ∈ {16, 18, 36, 40}, and some interesting new constructions for the cases k ∈ {8, 32}.
متن کاملElliptic Curve Groups and Chip-Firing Games
Abstract. The author illustrates several results from the theory of elliptic curves, as well as the theory of chip-firing games on graphs. More specifically, in both of these cases, we obtain analogues of cyclotomic polynomials with several combinatorial and number theoretic properties. We also provide an analysis of zeta functions which highlights the connections between these two disparate fi...
متن کاملFlat Cyclotomic Polynomials of Order Four and Higher
In this article we prove a result about sets of coefficients of cyclotomic polynomials. We then give corollaries related to flat cyclotomic polynomials and establish the first known infinite family of flat cyclotomic polynomials of order four. We end with some questions related to flat cyclotomic polynomials of order four and five.
متن کاملSpecial Polynomial Families for Generating More Suitable Pairing-Friendly Elliptic Curves
Constructing non-supersingular elliptic curves for pairing-based cryptosystems have attracted much attention in recent years. The best previous technique builds curves with ρ = lg(q) / lg(r) ≈ 1 (k = 12) and ρ = lg(q) / lg(r) ≈ 1.25 (k = 24). When k > 12, most of the previous works address the question by representing r(x) as a cyclotomic polynomial. In this paper, we propose a method to find m...
متن کامل